Coverage-biased Random Exploration of Models

نویسندگان

  • Marie-Claude Gaudel
  • Alain Denise
  • Sandrine-Dominique Gouraud
  • Richard Lassaigne
  • Johan Oudinet
  • Sylvain Peyronnet
چکیده

This paper describes a set of methods for randomly drawing traces in large models either uniformly among all traces, or with a coverage criterion as target. Classical random walk methods have some drawbacks. In case of irregular topology of the underlying graph, uniform choice of the next state is far from being optimal from a coverage point of view. Moreover, for the same reason, it is generally not practicable to get an estimation of the coverage obtained after one or several random walks: it would require some complex global analysis of the model topology. We present here some methods that give up the uniform choice of the next state. These methods bias this choice according to the number of traces, or states, or transitions, reachable via each successor.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Université Paris Sud – LRI 06 / 2010

This article presents optimizations of a randomized method that generates paths while ensuring a good coverage of the model, regardless its topology. The optimizations aim at diminishing the required memory, thus allowing the generation of longer paths. Pure random exploration generally leads to a bad coverage of the model. Methods, based on counting and uniform drawing in combinatorial structu...

متن کامل

On the Effectiveness of Random Testing for Android

Random testing of Android apps is attractive due to ease-of-use and scalability, but its effectiveness could be questioned. Prior studies have shown that Monkey – a simple approach and tool for random testing of Android apps – is surprisingly effective, “beating” much more sophisticated tools by achieving higher coverage. We study how Monkey’s parameters affect code coverage (at class, method, ...

متن کامل

Study of Random Biased d-ary Tries Model

Tries are the most popular data structure on strings. We can construct d-ary tries by using strings over an alphabet leading to d-ary tries. Throughout the paper we assume that strings stored in trie are generated by an appropriate memory less source. In this paper, with a special combinatorial approach we extend their analysis for average profiles to d-ary tries. We use this combinatorial appr...

متن کامل

A Comparison of Knowledge-Based GBFS Enhancements and Knowledge-Free Exploration

GBFS-based satisficing planners often augment their search with knowledge-based enhancements such as preferred operators and multiple heuristics. These techniques seek to improve planner performance by making the search more informed. In our work, we will focus on how these enhancements impact coverage and we will use a simple technique called ✏-greedy node selection to demonstrate that planner...

متن کامل

A macro-level model for investigating the effect of directional bias on network coverage

Random walks have been proposed as a simple method of efficiently searching, or disseminating information throughout, communication and sensor networks. In nature, animals (such as ants) tend to follow correlated random walks, i.e., random walks that are biased towards their current heading. In this paper, we investigate whether or not complementing random walks with directional bias can decrea...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Electr. Notes Theor. Comput. Sci.

دوره 220  شماره 

صفحات  -

تاریخ انتشار 2008